WhyMP, a formally verified arbitrary-precision integer library

نویسندگان

چکیده

Arbitrary-precision integer libraries such as GMP are a critical building block of computer algebra systems. provides state-of-the-art algorithms that intricate enough to justify formal verification. In this paper, we present C library has been formally verified using the Why3 verification platform in about four person-years. This deals not only with safety, but full functional correctness. It performed mixture mechanically checked handwritten proofs and automated theorem proving. We have implemented nontrivial subset GMP's algorithms, including their optimizations intricacies. Our same interface is almost efficient for smaller inputs. detail our methodology implemented, include some benchmarks compare GMP.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

How to Get an Efficient yet Verified Arbitrary-Precision Integer Library

The GNU Multi-Precision library is a widely used, safetycritical, library for arbitrary-precision arithmetic. Its source code is written in C and assembly, and includes intricate state-of-the-art algorithms for the sake of high performance. Formally verifying the functional behavior of such highly optimized code, not designed with verification in mind, is challenging. We present a fully verifie...

متن کامل

A Formally-Verified Alias Analysis

This paper reports on the formalization and proof of soundness, using the Coq proof assistant, of an alias analysis: a static analysis that approximates the flow of pointer values. The alias analysis considered is of the points-to kind and is intraprocedural, flow-sensitive, field-sensitive, and untyped. Its soundness proof follows the general style of abstract interpretation. The analysis is d...

متن کامل

Formally Verified Modular Semantics

This chapter presents the results of the validation and verification of a crucial component of BOS, a large safety-critical system that decides when to close and open the Maeslantkering, a storm surge barrier near the city of Rotterdam in the Netherlands. BOS was specified in the formal language Z and model checking has been applied to some of its subsystems during its development. A lightweigh...

متن کامل

Formally Verified System Initialisation

The safety and security of software systems depends on how they are initially configured. Manually writing program code that establishes such an initial configuration is a tedious and error-prone engineering process. In this paper we present an automatic and formally verified initialiser for component-based systems built on the general-purpose microkernel seL4. The construction principles of th...

متن کامل

Formally Verified On-Line Diagnosis

A recon gurable fault tolerant system achieves the attributes of dependability of operations through fault detection fault isolation and recon guration typically referred to as the FDIR paradigm Fault diagnosis is a key component of this approach requiring an accurate deter mination of the health and state of the system An imprecise state assessment can lead to catastrophic failure due to an op...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Symbolic Computation

سال: 2023

ISSN: ['1095-855X', '0747-7171']

DOI: https://doi.org/10.1016/j.jsc.2022.07.007